Orbit Equivalence and Sofic Approximation
نویسنده
چکیده
Given an ergodic probability measure preserving dynamical system Γ y (X,μ), where Γ is a finitely generated countable group, we show that the asymptotic growth of the number of finite models for the dynamics, in the sense of sofic approximation, is an invariant of orbit equivalence. We then prove an additivity formula for free products of orbit structures with amenable (possibly trivial) amalgamation. In particular, we obtain purely combinatorial proofs of several results in orbit equivalence theory.
منابع مشابه
Isomorphism invariants for actions of sofic groups
For every countable group G, a family of isomorphism invariants for measurepreserving G-actions on probability spaces is defined. In the special case in which G is a countable sofic group, a special class of these invariants are computed exactly for Bernoulli systems over G. This leads to a complete classification of Bernoulli systems for many countable groups including all finitely generated l...
متن کاملA new algebraic invariant for weak equivalence of sofic subshifts
It is studied how taking the inverse image by a sliding block code affects the syntactic semigroup of a sofic subshift. Two independent approaches are used: ζ-semigroups as recognition structures for sofic subshifts, and relatively free profinite semigroups. A new algebraic invariant is obtained for weak equivalence of sofic subshifts, by determining which classes of sofic subshifts naturally d...
متن کاملSofic equivalence relations
We introduce the notion of sofic measurable equivalence relations. Using them we prove that Connes’ Embedding Conjecture as well as the Measurable Determinant Conjecture of Lück, Sauer and Wegner hold for treeable equivalence relations.
متن کاملOn Flow Equivalence of Sofic Shifts
The flow equivalence of sofic shifts is examined using results about the structure of the corresponding covers. A canonical cover generalising the left Fischer cover to arbitrary sofic shifts is introduced and used to prove that the left Krieger cover and the past set cover of a sofic shift can be divided into natural layers. These results are used to find the range of a flow invariant and to i...
متن کاملThe Syntactic Graph of a Sofic Shift Is Invariant under Shift Equivalence
We define a new invariant for shift equivalence of sofic shifts. This invariant, that we call the syntactic graph of a sofic shift, is the directed acyclic graph of characteristic groups of the non null regular D-classes of the syntactic semigroup of the shift.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012